The Linguistic Relevance of Tree Adjoining Grammar
نویسندگان
چکیده
In this paper we apply a new notation for the writing of natural language grammars to some classical problems in the description of English. The formalism is the Tree Adjoining Grammar (TAG) of Joshi, Levy and Takahashi 1975, which was studied, initially only for its mathematical properties but which now turns out to be a interesting candidate for the proper notation of meta-grammar; that is for the universal grammar of contemporary linguistics. Interest in the application of the TAG formalism to the writing of natural language grammars arises out of recent work on the possibility of writing grammars for natural languages in a metatheory of restricted generative capacity (for example, Gazdar 1982 and Gazdar et al. 1985). There have been also several recent attempts to examine the linguistic metatheory of restricted grammatical formalisms, in particular, context-free grammars. The inadequacies of context-free grammars have been discussed both from the point of view of strong generative capacity (Bresnan et al. 1982) and weak generative capacity (Shieber 1984, Postal and Langendoen 1984, Higginbothem 1984, the empirical claims of the last two having been disputed by Pullum (Pullum 1984)). At this point TAG grammar becomes interesting because while it is more powerful than context-free grammar, it is only "mildly" so. This extra power of TAG is a direct corollary of the way TAG factors recursion and dependencies, and it can provide reasonable structural descriptions for constructions like Dutch verb raising where context-free grammar apparently fails. These properties of TAG and some of its mathematical properties were discussed by Joshi 1983. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-85-16. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/671 THE LINGUISTIC RELEVANCE OF TREE ADJOINING GRAMMAR* Anthony S. Krocht and Aravind K. Joshi tt Department of Computer and Information Science Room 268 Moore School/DIL University of Pennsyhania Philadelphia, PA 19104
منابع مشابه
Some Computational Properties of tree Adjoining Grammars
Tree Adjoining Grammar (TAG) is u formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Jo~hi,Levy, mad Takakashi I~'Sl and by [Jo~hi, l ~ l . A detailed investigation of the linguistic relevance of TAG's has been carried out in IKroch and Joshi,1985~. In this paper, we will describe some new results for TAG's, espe¢ially in the following areas: (I) par...
متن کاملComplexity Of Description Of Primitives: Relevance To Local Statistical Computations
In this paper we pursue the idea that by making the descriptions of primitive items (lexical items in the linguistic context) more complex, we can make the computation of linguistic structure more local 1. The idea is that by making the descriptions of primitives more complex, we can not only make more complex constraints operate more locally but also verify these constraints more locally. Stat...
متن کاملThe Relationship Between Tree Adjoining Grammars And Head Grammarst
67 We examine the relationship between the two grammatical formalisms: Tree Adjoining Grammars and Head Grammars. We briefly investigate the weak equivalence of the two formalisms. We then turn to a discussion comparing the linguistic expressiveness of the two formalisms.
متن کاملStarting with complex primitives pays off: complicate locally, simplify globally
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible, and then introduce various operations for constructing more complex structures. An alternate approach is to start with complex (more complicated) primitives, which directly capture some crucial linguistic properties ...
متن کاملIntegrating a Unification-Based Semantics in a Large Scale Lexicalised Tree Adjoining Grammar for French
In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Grammar (TAG) equiped with a compositional semantics. In this paper, we report on the integration of a unification-based semantics into a Feature-Based Lexicalised TAG for French consisting of around 6 000 trees. We focus on verb semantics and show how factorisation can be used to support a compact and principled encodi...
متن کامل